Rules of conceptual well-formednessand optional vs. obligatory iterativity
نویسندگان
چکیده
منابع مشابه
Instatiations and (obligatory vs. optional) actants
A formalism for ~he representation of "semantic emphases" is introduced, using principal and accessory instantiatiQns. It m~es it possible to convert predicate expressions inbo network-like structures. As an application criteria for ooligatory and optional actants are dealt with. 11 ~ 12, t I ~ t2, t I starts t2, t I finishes t 2 etco (Allen (1984); Bier-winch (1988) for the general framework)....
متن کاملOptional and Obligatory Modal Subordination ∗
This paper raises the empirical point that modal subordination is not always obligatory, and that moreover, this is a point of lexical variation. Some modals, like will, which I call definite modals, undergo modal subordination obligatorily, and some, like gonna, which I call nondefinite modals, do so optionally. I propose a dynamic framework in which, following from Frank (1997), information s...
متن کاملBases for parametrized iterativity
Parametrized iterativity of an algebra means the existence of unique solutions of all finitary recursive systems of equations where recursion is allowed to use only some variables (chosen as a parameter). We show how such algebras can be introduced in an arbitrary category A by employing a base, i.e., an operation interpreting objects of A as monads on A. For every base we prove that free base ...
متن کاملObligatory and optional personal life investments in old and very old age: Validation and functional relations
Personal life investment (PLI) measures motivational energy invested in central life domains. We distinguished between obligatory PLIs, that is, required investments, and optional PLIs, that is, investments that are possible but not necessary. Data from the Berlin Aging Study (N = 516; 70–103 years) were employed to investigate the validity of this distinction. We further explored how both PLI ...
متن کاملRules Dependencies in Backward Chaining of Conceptual Graphs Rules
Conceptual Graphs Rules were proposed as an extension of Simple Conceptual Graphs (CGs) to represent knowledge of form “if A then B”, where A and B are simple CGs. Optimizations of the deduction calculus in this KR formalism include a Backward Chaining that unifies at the same time whole subgraphs of a rule, and a Forward Chaining that relies on compiling dependencies between rules. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stellenbosch Papers in Linguistics
سال: 2012
ISSN: 2223-9936,1027-3417
DOI: 10.5774/17-0-93